Average prime-pair counting formula
نویسندگان
چکیده
Taking r > 0, let π2r(x) denote the number of prime pairs (p, p+ 2r) with p ≤ x. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r > 0. There seems to be no good conjecture for the remainders ω2r(x) = π2r(x)−2C2r li2(x) that corresponds to Riemann’s formula for π(x)− li(x). However, there is a heuristic approximate formula for averages of the remainders ω2r(x) which is supported by numerical results.
منابع مشابه
Counting proofs in propositional logic
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
متن کاملOn the Means of the Values of Prime Counting Function
In this paper, we investigate the means of the values of prime counting function $pi(x)$. First, we compute the arithmetic, the geometric, and the harmonic means of the values of this function, and then we study the limit value of the ratio of them.
متن کاملFrequencies of Successive Pairs of Prime Residues
We consider statistical properties of the sequence of ordered pairs obtained by taking the sequence of prime numbers and reducing modulo m. Using an inclusion/exclusion argument and a cut-off of an infinite product suggested by Pólya, we obtain a heuristic formula for the “probability” that a pair of consecutive prime numbers of size approximately x will be congruent to (a, a+d) modulo m. We de...
متن کاملCounting Primes whose Sum of Digits is Prime
Motivated by recent work of Drmota, Mauduit and Rivat, we discuss the possibility of counting the number of primes up to x whose sum of digits is also prime. We show that, although this is not possible unless we assume a hypothesis on the distribution of primes stronger than what is implied by the Riemann hypothesis, we can establish a Mertens-type result. That is, we obtain a formula for the n...
متن کاملCounting Number of Fuzzy Subgroups of Some of Dihedral Groups
Abstract: In this paper, we compute number of fuzzy subgroups of some dihedral groups such as D2pn where p is a prime number and D2p1×p2×···×pn where p1, p2, ..., pn are distinct prime numbers. We use their chain diagram to determine the number of their fuzzy subgroups and present an explicit recursive formula to D2pn and at the result in specially case D2n and finally a formula to count number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 79 شماره
صفحات -
تاریخ انتشار 2010